The International SAT Solver Competitions

is satisfiable is one of the most fundamental problems in computer science, known as the canonical NP-complete Boolean satisfiability (SAT) problem (Biere et al. 2009). In addition to its theoretical importance, major advances in the development of robust implementations of decision procedures for SAT, SAT solvers, have established SAT as an important declarative approach for attacking various complex search and optimization problems. Modern SAT solvers are routinely used as core solving engines in vast numbers of different AI and industrial applications. The International SAT Solver Competition1 is today an established series of competitive events aiming at objectively evaluating the progress in state-of-the-art SAT solving techniques. In this short article, we will provide an overview of the SAT solver competitions. Competition Reports